Polynomials that preserve nonnegative matrices

نویسندگان

چکیده

In further pursuit of a solution to the celebrated nonnegative inverse eigenvalue problem, Loewy and London ((1978/1979) [8]) posed problem characterizing all polynomials that preserve matrices fixed order. If Pn denotes set n-by-n matrices, then it is clear with coefficients belong Pn. However, known contains negative entries. this work, novel results for respect belonging Along way, generalization even-part odd-part are given shown be equivalent another construction appeared in literature. Implications research discussed.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characteristic Polynomials of Nonnegative Integral Square Matrices and Clique Polynomials

Clique polynomials of vertex-weighted simple graphs coincide with polynomials of the form det(1 − xM), M a square matrix over N.

متن کامل

Hoffman Polynomials of Nonnegative Irreducible Matrices and Strongly Connected Digraphs

For a nonnegative n× n matrix A, we find that there is a polynomial f(x) ∈ R[x] such that f(A) is a positive matrix of rank one if and only if A is irreducible. Furthermore, we show that the lowest degree such polynomial f(x) with tr f(A) = n is unique. Thus, generalizing the well-known definition of the Hoffman polynomial of a strongly connected regular digraph, for any irreducible nonnegative...

متن کامل

Nonnegative Matrices

For a loopless, acyclic, transitive directed graph S, we study the relations between the predecessor property and the well structured property on S. These properties assure the existence of nonnegativ€ Jordan bases for any nonnegative matrix with singular graph S.

متن کامل

Linear Operators That Preserve Graphical Properties of Matrices: Isolation Numbers

Let A be a Boolean {0, 1} matrix. The isolation number of A is the maximum number of ones in A such that no two are in any row or any column (that is they are independent), and no two are in a 2 × 2 submatrix of all ones. The isolation number of A is a lower bound on the Boolean rank of A. A linear operator on the set of m× n Boolean matrices is a mapping which is additive and maps the zero mat...

متن کامل

Linear operators that strongly preserve graphical properties of matrices - II

Beasley, L.B. and N.J. Pullman, Linear operators that strongly preserve graphical properties of matrices, Discrete Mathematics 104 (1992) 143-157. An operator on the set Ju of n X n matrices strongly preserves a subset 9 if it maps 9 into 9 and A\% into A\%. The operator semigroup of 9 is the semigroup of linear operators strongly preserving 9. We show that all the n x n matrix-families which a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2022

ISSN: ['1873-1856', '0024-3795']

DOI: https://doi.org/10.1016/j.laa.2021.12.007